Dewey a Scaling Algorithm for Multicommodity Flow Problems a Scaling Algorithm for Multicommodity Flow Problems
نویسندگان
چکیده
We present a penalty-based algorithm that solves the multicommodity flow problem as a sequence of a fmite number of scaling phases. In the 8-scaling phase the algorithm determines an eoptimal solution, that is, one in which complementary slackness conditions are satisfied to within 8. We analyze the performance of the algorithm from both the theoretical and practical perspectives.
منابع مشابه
Global scaling of the Proximal Decomposition algorithm for convex multicommodity flow problems
We analyze here the behaviour of the Proximal Decomposition algorithm with global and adaptive scaling. The algorithm is well adapted to solve convex multicommodity flow problems that arise in Network Routing problems with QoS requirements. Numerical tests performed on quadratic models confirm that adaptive global scaling subsumes former scaling strategies with one or many parameters.
متن کاملA capacity scaling heuristic for the multicommodity capacitated network design problem
In this paper, we propose a capacity scaling heuristic using a column generation and row generation technique to address the multicommodity capacitated network design problem. The capacity scaling heuristic is an approximate iterative solution method for capacitated network problems based on changing arc capacities, which depend on flow volumes on the arcs. By combining a column and row generat...
متن کاملA Simulated Annealing Algorithm for Unsplittable Capacitated Network Design
The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...
متن کاملMulticommodity Flow
Leighton and Rao use multicommodity flow results to design the first polynomial time approximation algorithms for well known NP-Hard optimization problems. Such problems include graph partitioning, crossing number, VLSI layout, and many more. Furthermore, Leighton and Rao are responsible for establishing the max-flow min-cut theorems on multicommodity flow problems, which lead to the algorithms...
متن کاملOptimal multicommodity flows in dynamic networks and algorithms for their finding
In this paper we study two basic problems related to dynamic flows: maximum multicommodity flow and the minimum cost multicommodity flow problems. We consider these problems on dynamic networks with time-varying capacities of edges. For minimum cost multicommodity flow problem we assume that cost functions, defined on edges, are nonlinear and depending on time and flow, and the demand function ...
متن کامل